Five-torsion in the homology of the matching complex on 14 vertices

نویسنده

  • Jakob Jonsson
چکیده

J.L. Andersen proved that there is 5-torsion in the bottom nonvanishing homology group of the simplicial complex of graphs of degree at most two on seven vertices. We use this result to demonstrate that there is 5-torsion also in the bottom nonvanishing homology group of the matching complex M14 on 14 vertices. Combining our observation with results due to Bouc and to Shareshian and Wachs, we conclude that the case n= 14 is exceptional; for all other n, the torsion subgroup of the bottom nonvanishing homology group has exponent three or is zero. The possibility remains that there is other torsion than 3-torsion in higher-degree homology groups of Mn when n≥ 13 and n = 14.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More Torsion in the Homology of the Matching Complex

Using computers, we analyze the integral homology of the matching complex Mn, which is the simplicial complex of matchings in the complete graph on n vertices. Our main result is the detection of p-torsion in the homology for p ∈ {5, 7, 11, 13}. Specifically, we show that there is nonvanishing 5-torsion in the homology of Mn for n ≥ 18 and for n ∈ {14, 16}. The only previously known value was n...

متن کامل

3-torsion in the homology of complexes of graphs of bounded degree

For δ ≥ 1 and n ≥ 1, we examine the simplicial complex of graphs on n vertices in which each vertex has degree at most δ; we identify a given graph with its edge set and admit one loop at each vertex. δ = 1 yields the matching complex, and it is known that there is 3-torsion in degree d of the homology of this complex whenever n−4 3 ≤ d ≤ n−6 2 . We establish similar bounds for δ ≥ 2. Specifica...

متن کامل

Matching Integral Graphs of Small Order

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

متن کامل

Sex-related Left Ventricle Rotational and Torsional Mechanics by Block Matching Algorithm

Background: The aim of the present study was to evaluate how left ventricular twist and torsion are associated with sex between sex groups of the same age.Materials and Methods: In this analytical study, twenty one healthy subjects were scanned in left ventricle basal and apical short axis views to run the block matching algorithm; instantaneous changes in the base and apex rotation angel...

متن کامل

Paired-Domination Game Played in Graphs

In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008